Interpolation of panchromatic and color pixels

ABSTRACT

A method for forming a final digital color image, includes: capturing an image using an image sensor having panchromatic pixels and color pixels corresponding to at least two color photoresponses; providing from the captured image a digital high resolution panchromatic image and a digital high resolution color differences image; and using the digital high resolution panchromatic image and the digital high resolution color differences image to produce the final digital high resolution full color image.

Reference is made to commonly-assigned U.S. patent application Ser. No. 11/191,729, filed Jul. 28, 2005, entitled “Image Sensor With Improved Light Sensitivity” by John T. Compton et al, and U.S. patent application Ser. No. ______, filed concurrently herewith, entitled “Image Sensor With Improved Light Sensitivity” by Takayuki Kijima et al the disclosure of which is incorporated herein.

FIELD OF THE INVENTION

The invention relates generally to the field of digital image processing operations that are particularly suitable for use in all sorts of imaging devices.

BACKGROUND OF THE INVENTION

Video cameras and digital still cameras generally employ a single image sensor with a color filter array to record a scene. This approach begins with a sparsely populated single-channel image in which the color information is encoded by the color filter array pattern. Subsequent interpolation of the neighboring pixel values permits the reconstruction of a complete three-channel, full-color image. One example of this process can be found in U.S. Pat. No. 5,506,619, Hamilton et al.

Under low-light imaging situations, it is advantageous to have one or more of the pixels in the color filter array unfiltered, i.e. white or panchromatic in spectral sensitivity. These panchromatic pixels have the maximum light sensitivity capability of the capture system. Employing panchromatic pixels represents a tradeoff in the capture system between light sensitivity and color spatial resolution. To this end, many four-color color filter array systems have been described. U.S. Pat. No. 6,529,239, Dyck et al. teaches a green-cyan-yellow-white pattern that is arranged as a 2×2 block that is tessellated over the surface of the sensor. U.S. Pat. No. 6,757,012, Hubina et al. discloses both a red-green-blue-white pattern and a yellow-cyan-magenta-white pattern. In both cases the colors are arranged in a 2×2 block that is tessellated over the surface of the imager. The difficulty with such systems is that only one-quarter of the pixels in the color filter array have maximum light sensitivity, thus limiting the overall low-light performance of the capture device.

To address the need of having more pixels with maximum light sensitivity in the color filter array, U.S. Patent Application Publication 2003/0210332, Frame, describes a pixel array with most of the pixels being unfiltered. Relatively few pixels are devoted to capturing color information from the scene producing a system with low color spatial resolution capability. Additionally, Frame teaches using simple linear interpolation techniques that are not responsive to, or protective of high frequency color spatial details in the image.

What is needed is color filter array with an appropriate composition of panchromatic and color pixels in order to provide both improved low-light sensitivity and improved color spatial resolution fidelity. Additionally, a method is needed to process the image data produced by such a color filter array in order to preserve and enhance panchromatic and color spatial details and ultimate produce a full-color, full-resolution image.

SUMMARY OF THE INVENTION

The present invention provides a method for forming a final digital color image, comprising:

(a) capturing an image using an image sensor having panchromatic pixels and color pixels corresponding to at least two color photoresponses;

(b) providing from the captured image a digital high resolution panchromatic image and a digital high resolution color differences image; and

(c) using the digital high resolution panchromatic image and the digital high resolution color differences image to produce the final digital high resolution full color image.

It is a feature of the present invention that images can be captured under low-light capture with improved image fidelity.

It is another feature of the present invention that image fidelity is improved through the use of adaptive image processing strategies.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a perspective of a computer system including a digital camera for implementing the present invention;

FIG. 2 is a block diagram of a preferred embodiment;

FIG. 3 is a more detailed block diagram of block 204 in FIG. 2;

FIG. 4 is a region of pixels in block 200 in FIG. 2;

FIG. 5 is a region of pixels used in block 202 in FIG. 2;

FIG. 6 is a region of pixels produced in block 202 in FIG. 2;

FIG. 7 is a region of pixels used in block 204 in FIG. 2;

FIG. 8 is a region of pixels produced in block 204 in FIG. 2;

FIG. 9 is a region of pixels produced in block 206 in FIG. 2;

FIG. 10 is a region of pixels produced in block 210 in FIG. 2;

FIG. 11 is a region of pixels produced in block 200 in FIG. 2 of an alternate embodiment;

FIG. 12 is a region of pixels used in block 202 in FIG. 2 of an alternate embodiment;

FIG. 13 is a region of pixels used in block 204 in FIG. 2 of an alternate embodiment;

FIG. 14 is a region of pixels produced in block 200 in FIG. 2 of an alternate embodiment;

FIG. 15 is a region of pixels use in block 202 in FIG. 2 of an alternate embodiment;

FIG. 16 is a region of pixels used in block 204 in FIG. 2 of an alternate embodiment;

FIG. 17 is a region of pixels produced in block 204 in FIG. 2 of an alternate embodiment;

FIG. 18 is a region of pixels in block 210 in FIG. 2 of an alternate embodiment;

FIG. 19 is a region of pixels produce in block 200 in FIG. 2 of an alternate embodiment;

FIG. 20 is a region of pixels used in block 202 in FIG. 2 of an alternate embodiment;

FIG. 21 is a region of pixels used in block 204 in FIG. 2 of an alternate embodiment; and

FIG. 22 is a region of pixels produced in block 204 in FIG. 2 of an alternate embodiment.

DETAILED DESCRIPTION OF THE INVENTION

In the following description, a preferred embodiment of the present invention will be described in terms that would ordinarily be implemented as a software program. Those skilled in the art will readily recognize that the equivalent of such software can also be constructed in hardware. Because image manipulation algorithms and systems are well known, the present description will be directed in particular to algorithms and systems forming part of, or cooperating more directly with, the system and method in accordance with the present invention. Other aspects of such algorithms and systems, and hardware or software for producing and otherwise processing the image signals involved therewith, not specifically shown or described herein, can be selected from such systems, algorithms, components and elements known in the art. Given the system as described according to the invention in the following materials, software not specifically shown, suggested or described herein that is useful for implementation of the invention is conventional and within the ordinary skill in such arts.

Still further, as used herein, the computer program can be stored in a computer readable storage medium, which can include, for example; magnetic storage media such as a magnetic disk (such as a hard drive or a floppy disk) or magnetic tape; optical storage media such as an optical disc, optical tape, or machine readable bar code; solid state electronic storage devices such as random access memory (RAM), or read only memory (ROM); or any other physical device or medium employed to store a computer program.

Before describing the present invention, it facilitates understanding to note that the present invention is preferably utilized on any well-known computer system, such a personal computer. Consequently, the computer system will not be discussed in detail herein. It is also instructive to note that the images are either directly input into the computer system (for example by a digital camera) or digitized before input into the computer system (for example by scanning an original, such as a silver halide film).

Referring to FIG. 1, there is illustrated a computer system 110 for implementing the present invention. Although the computer system 110 is shown for the purpose of illustrating a preferred embodiment, the present invention is not limited to the computer system 110 shown, but can be used on any electronic processing system such as found in home computers, kiosks, retail or wholesale photofinishing, or any other system for the processing of digital images. The computer system 110 includes a microprocessor-based unit 112 for receiving and processing software programs and for performing other processing functions. A display 114 is electrically connected to the microprocessor-based unit 112 for displaying user-related information associated with the software, e.g., by a graphical user interface. A keyboard 116 is also connected to the microprocessor based unit 112 for permitting a user to input information to the software. As an alternative to using the keyboard 116 for input, a mouse 118 can be used for moving a selector 120 on the display 114 and for selecting an item on which the selector 120 overlays, as is well known in the art.

A compact disk-read only memory (CD-ROM) 124, which typically includes software programs, is inserted into the microprocessor based unit for providing a way of inputting the software programs and other information to the microprocessor based unit 112. In addition, a floppy disk 126 can also include a software program, and is inserted into the microprocessor-based unit 112 for inputting the software program. The compact disk-read only memory (CD-ROM) 124 or the floppy disk 126 can alternatively be inserted into externally located disk drive unit 122 which is connected to the microprocessor-based unit 112. Still further, the microprocessor-based unit 112 can be programmed, as is well known in the art, for storing the software program internally. The microprocessor-based unit 112 can also have a network connection 127, such as a telephone line, to an external network, such as a local area network or the Internet. A printer 128 can also be connected to the microprocessor-based unit 112 for printing a hardcopy of the output from the computer system 110.

Images can also be displayed on the display 114 via a personal computer card (PC card) 130, such as, as it was formerly known, a PCMCIA card (based on the specifications of the Personal Computer Memory Card International Association) which contains digitized images electronically embodied in the PC card 130. The PC card 130 is ultimately inserted into the microprocessor based unit 112 for permitting visual display of the image on the display 114. Alternatively, the PC card 130 can be inserted into an externally located PC card reader 132 connected to the microprocessor-based unit 112. Images can also be input via the compact disk 124, the floppy disk 126, or the network connection 127. Any images stored in the PC card 130, the floppy disk 126 or the compact disk 124, or input through the network connection 127, can have been obtained from a variety of sources, such as a digital camera (not shown) or a scanner (not shown). Images can also be input directly from a digital camera 134 via a camera docking port 136 connected to the microprocessor-based unit 112 or directly from the digital camera 134 via a cable connection 138 to the microprocessor-based unit 112 or via a wireless connection 140 to the microprocessor-based unit 112.

In accordance with the invention, the algorithm can be stored in any of the storage devices heretofore mentioned and applied to images in order to interpolate sparsely populated images.

FIG. 2 is a high level diagram of the preferred embodiment. The digital camera 134 is responsible for creating an original digital red-green-blue-panchromatic (RGBP) color filter array (CFA) image 200, also referred to as the digital RGBP CFA image or the RGBP CFA image. This image is considered to be a sparsely sampled image because each pixel in the image contains only one pixel value of red, green, blue, or panchromatic data. A copy of block 200 is passed to the low resolution RGB CFA image creation block 202. Block 202 creates a digital low resolution RGB CFA image, also referred to as a low resolution RGB CFA image, from the RGBP CFA image. Another copy of block 200 is passed to the high resolution panchromatic image creation block 204. Block 204 creates a digital high resolution panchromatic image also referred to as the high resolution panchromatic image from the RGBP CFA image. The output of block 204 is passed to the low resolution panchromatic image creation block 206. Block 206 creates a digital low resolution panchromatic image, also referred to as a low resolution panchromatic image, from the high resolution panchromatic image. The output of block 206 and the output of block 202 are passed to the low resolution color differences creation block 208. Block 208 creates a low resolution color differences image by subtracting the low resolution panchromatic image from the low resolution RGB CFA image. The output of block 208 is passed to the low resolution color differences image interpolation block 216. Block 216 performs a Bayer CFA interpolation operation on the low resolution color differences. An example of such a Bayer CFA interpolation can be found in U.S. Pat. No. 5,506,619, Hamilton et al., though is should be apparent to those skilled in the art that other Bayer CFA interpolation methods can be used. The result of block 216 is a digital interpolated low resolution color differences image, also referred to as an interpolated low resolution color differences image, with three color difference values for each pixel. The output of block 216 is passed to the high resolution color differences creation block 210. Block 210 creates a digital high resolution color differences image, also referred to as the high resolution color differences image, by bilinearly interpolating (upsizing) the low resolution color differences image. The output of block 210 and the output of block 204 are passed to the high resolution full color image creation block 212. Block 212 creates a digital high resolution full color image also referred to as the high resolution full color image 214 by adding the high resolution panchromatic image to the high resolution color differences image.

FIG. 3 is a more detailed diagram of the high resolution panchromatic image creation block 204 in FIG. 2. The RGBP CFA image 200 (FIG. 2) is passed to the pixel neighborhood predictor computation block 300. Block 300 computes a set of pixel neighborhood predictor values. The results of block 300 are passed to the pixel neighborhood classifier computation block 302. Block 302 computes a set of pixel neighborhood classifier values with each classifier value corresponding to one of the predictor values computed in block 300. The results of block 302 are passed to the direction of computation determination block 304. Block 304 determines a preferred direction of computation based on the set of classifier values produced in block 302. The result of block 304 and the results of block 300 are passed to the high resolution panchromatic pixel value computation block 306. Block 306 selects an appropriate predictor value from the results of block 300 corresponding to the direction determined by block 304. This selected predictor value then become the interpolated high resolution panchromatic pixel value. The results of block 306 become the output of block 204 (FIG. 2).

FIG. 4 is a region of pixels repeated throughout the RGBP CFA image block 200 (FIG. 2). The salient aspect of FIG. 4 is the two rows of panchromatic pixels are separated by alternating rows of red and green pixels and green and blue pixels.

FIG. 5 is a region of pixels used by low resolution RGB CFA image creation block 202 (FIG. 2) to produce the region of pixels illustrated in FIG. 6. The following expressions are used in the preferred embodiment to produce the pixel values in FIG. 6. R′ ₁ =k(R ₁ +R ₃ +R ₅) G′ ₂ =k(G ₄ +G ₆ +G ₈) G′ ₃ =k(G ₉ +G ₁₁ +G ₁₃) B′ ₄ =k(B ₁₂ +B ₁₄ +B ₁₆) In these expression k is a scale factor to produce the desired pixel value range of the output values. Typical values for k are one-third to produce an average pixel value and one to produce a summed pixel value. It is noted that within the scope of this invention the creation of one pixel value from three pixel values is a form of subsampling. In an alternate embodiment of the present invention a different set of expressions for block 202 are used as follows. R′ ₁ =k(R ₁ +R ₃ +R ₅) G′ ₂ =k(G ₂ +G ₄ +G ₆) G′ ₃ =k(G ₉ +G ₁₁ +G ₁₃) B′ ₄ =k(B ₁₀ +B ₁₂ +B ₁₄)

FIG. 7 is a region of pixels used by both the pixel neighborhood prediction computation block 300 (FIG. 3) and the pixel neighborhood classifier computation block 302 (FIG. 3). There are two sets of predictor values computed by block 300 (FIG. 3). For the case when the central pixel of the pixel neighborhood is a green pixel, such as G₁₅ in FIG. 7, the following predictor values are computed. p _(slash)=(P ₁₀ +P ₂₀)/2 p _(vertical)=(P ₉ +P ₂₁)/2 p _(backslash)=(P ₈ +P ₂₂)/2 p_(horizontal)=G₁₅ p_(left)=G₁₅ p_(right)=G₁₅ p _(cubic)=(−P ₃+4P ₉+4P ₂₁ −P ₂₇)/6 For the case when the central pixel of the pixel neighborhood is not a green pixel, such as B₁₆ in FIG. 7, the following predictor values are computed. p _(slash)=(P ₁₁ +P ₂₁)/2 p _(vertical)=(P ₁₀ +P ₂₂)/2 p _(backslash)=(P ₉ +P ₂₃)/2 p _(horizontal)=(G ₁₅ +G ₁₇)/2 p_(left)=G₁₅ p_(right)=G₁₇ p _(cubic)(−P ₄+4P ₁₀+4P ₂₂ −P ₂₈)/6 There is one set of classifier values computed by block 302 (FIG. 3). Though the color of the central pixel in a given neighborhood can be different, the same expressions are used for computing the classifiers. Two examples are now given. For the case when the central pixel of the pixel neighborhood is a green pixel, such as G₁₅ in FIG. 7, the following classifier values are computed. c _(slash) =|P ₁₁ −P ₂₁ |+|P ₁₀ −P ₂₀ |+|P ₉ −P ₁₉|+|2p _(cubic) −P ₁₀ −P ₂₀|/4 c _(vertical) =|P ₁₀ −P ₂₂ |+|P ₉ −P ₂₁ |+|P ₈ −P ₂₀|+|2p _(cubic) −P ₉ −P ₂₁|/4 c _(backslash) =|P ₉ −P ₂₃ |+|P ₈ −P ₂₂ |+|P ₇ −P ₂₁|+|2p _(cubic) −P ₈ −P ₂₂|/4 c _(horizontal) =|B ₁₄ −B ₁₆ |+|P ₈ −P ₁₀ |+|P ₂₀ −P ₂₂|+|2G ₁₅ −G ₁₃ −G ₁₇|/8+t ₁ c _(left) =|G ₁₅ −G ₁₃ |+|P ₉ −P ₂₁ |+|P ₈ −P ₂₀|+|2G ₁₅ −G ₁₃ −G ₁₇|/8+t ₂ c _(right) =|G ₁₅ −G ₁₇ |+|P ₉ −P ₂₁ |+|P ₁₀ −P ₂₂|+|2G ₁₅ −G ₁₃ −G ₁₇|/8+t ₂ The values t₁ and t₂ are threshold values that are chosen to reduce, but not eliminate, the likelihood of c_(horizontal), c_(left), and c_(right) of being smaller than c_(slash), C_(vertical), or c_(backslash). Typical values for t₁ and t₂ are 20 and 40 for an 8-bit pixel value data range. For the case when the central pixel of the pixel neighborhood is not a green pixel, such as B₁₆ in FIG. 7, the following classifier values are computed. c _(slash) =|P ₁₂ −P ₂₂ |+|P ₁₁ −P ₂₁ |+|P ₁₀ −P ₂₀|+|2p _(cubic) −P ₁₁ −P ₂₁|/4 c _(vertical) =|P ₁₁ −P ₂₃ |+|P ₁₀ −P ₂₂ |+|P ₉ −P ₂₁|+|2p _(cubic) −P ₁₀ −P ₂₂|/4 c _(backslash) =|P ₁₀ −P ₂₄ |+|P ₉ −P ₂₃ |+|P ₈ −P ₂₂|+|2p _(cubic) −P ₉ −P ₂₃|/4 c _(horizontal) =|G ₁₅ −G ₁₇ |+|P ₉ −P ₁₁ |+|P ₂₁ −P ₂₃|+|2B ₁₆ −B ₁₄ −B ₁₈8+t ₁ c _(left) =|B ₁₆ −B ₁₄ |+|P ₁₀ −P ₂₂ |+|P ₉ −P ₂₁|+2B ₁₆ −B ₁₄ −B ₁₈/8+t ₂ c _(right) =|B ₁₆ −B ₁₈ |+|P ₁₀ −P ₂₂ |+|P ₁₁ −P ₂₃|+|2B ₁₆ −B ₁₄ −B ₁₈|/8+t ₂ It should be noted that these expressions are substantially the same in both examples. For a red pixel centered neighborhood, one would take the classifiers from the second example and exchange red pixel values for blue pixel values.

Returning to FIG. 3, the classifier values computed in block 302 are passed to the direction of computation determination block 304. In block 304 each classifier value is compared to an activity threshold, t_(activity). A typical value for t_(activity) is 200 for an 8-bit pixel value data range. If all classifier values are greater than or equal to the activity threshold, then the direction of computation becomes a special case that is associated with the predictor value p_(cubic). Failing this first test, the classifier with the smallest value is determined. The direction associated with this classifier becomes the output of block 304. The output of block 304 and the output of block 300 are passed to the high resolution panchromatic pixel value computation block 306. In block 306 for each pixel neighborhood centered on a red, green, or blue pixel, the predictor value corresponding to the direction of computation determined in block 304 becomes the interpolated panchromatic value. A portion of the resulting high resolution panchromatic channel is illustrated in FIG. 8. In FIG. 8 the values without subscripts represent original existing panchromatic values and the values with subscripts represent interpolated panchromatic values. Additionally, FIG. 8 is a region of pixels used by low resolution panchromatic image creation block 206 (FIG. 2) to produce the region of pixels illustrated in FIG. 9. The following expressions are used in the preferred embodiment to produce the pixel values in FIG. 9. P′ ₁ =k(P ₁ +P ₃ +P ₅) P′ ₂ =k(P ₄ +P ₆ +P ₈) P′ ₃ =k(P ₉ +P ₁₁ +P ₁₃) P′ ₄ =k(P ₁₂ +P ₁₄ +P ₁₆) In these expression k is a scale factor to produce the desired pixel value range of the output values. Typically, k is one-third to produce an average pixel value. In an alternate embodiment of the present invention a different set of expressions for block 206 (FIG. 2) is used as follows. P′ ₁ =k(P ₁ +P ₃ +P ₅) P′ ₂ =k(P ₂ +P ₄ +P ₆) P′ ₃ =k(P ₉ +P ₁₁ +P ₁₃) P′ ₄ =k(P ₁₀ +P ₁₂ +P ₁₄)

FIG. 10 is a region of pixels created from the high resolution color differences creation block 210 (FIG. 2). In FIG. 10, X₁ and X₄ represent existing color difference values in the low resolution color differences image created by block 208 (FIG. 2). Interpolated color difference values X₂ and X₃ are computed in block 210 (FIG. 2) with the following expressions: X ₂=(2X ₁ +X ₄)/3 X ₃=(X ₁+2X ₄)/3 As is standard practice for bilinear interpolation, this operation is first performed on each row to triple the amount of color difference values in each row. The computation is then repeated in the vertical direction on each column to triple the amount of color difference values in each column. The output of block 210 is sent to the high resolution full color image creation block 212.

An alternate embodiment of the present invention is now described. FIG. 2 and FIG. 3 are as in the preferred embodiment. FIG. 11 is an alternate region of pixels repeated throughout the RGBP CFA image block 200 (FIG. 2). The salient aspect of FIG. 11 is that two rows of panchromatic pixels are separated by alternating rows of three adjacent red then three adjacent green pixels and three adjacent green and then three adjacent blue pixels.

FIG. 12 is an alternate region of pixels used by low resolution RGB CFA image creation block 202 (FIG. 2) to produce the region of pixels illustrated in FIG. 6. The following expressions are used in this alternate embodiment to produce the pixel values in FIG. 6. R′ ₁ =k(R ₁₁ +R ₁₂ +R ₁₃) G′ ₂ =k(G ₁₄ +G ₁₅ +G ₁₆) G′ ₃ =k(G ₂₁ +G ₂₂ +G ₂₃) B′ ₄ =k(B ₂₄ +B ₂₅ +B ₂₆)

In these expression k is a scale factor to produce the desired pixel value range of the output values. Typical values for k are one-third to produce an average pixel value and one to produce a summed pixel value. It is noted that within the scope of this invention the creation of one pixel value from three pixel values is a form of subsampling.

FIG. 13 is an alternate region of pixels used by both the pixel neighborhood prediction computation block 300 (FIG. 3) and the pixel neighborhood classifier computation block 302 (FIG. 3). For the case when the central pixel of the pixel neighborhood is a blue or red pixel, such as B₃₃ in FIG. 13, the following predictor values are computed. P_(slash) = (P₄₂ + P₂₄)/2 P_(vertical) = (P₂₃ + P₄₃)/2 P_(backslash) = (P₂₂ + P₄₄)/2 $P_{horizontal} = \left\{ {{\begin{matrix} {{\left( {{3G_{31}} + G_{35}} \right)/4},} & {{for}\quad B_{32}} \\ {{\left( {G_{31} + G_{35}} \right)/2},} & {{for}\quad B_{33}} \\ {{\left( {G_{31} + {3G_{35}}} \right)/4},} & {{for}\quad B_{34}} \end{matrix}P_{left}} = {{{\left( {P_{23} + R_{43}} \right)/2}P_{right}} = {{{\left( {P_{23} + P_{43}} \right)/2}P_{cubic}} = {\left( {{- P_{13}} + {4P_{23}} + {4P_{43}} - P_{53}} \right)/6}}}} \right.$ For the case when the central pixel of the pixel neighborhood is a green pixel, then p_(horizontal) becomes simply the green central pixel value. There is one set of classifier values computed by block 302 (FIG. 3). Though the color of the central pixel in a given neighborhood can be different, the same expressions are used for computing the classifiers. Returning to FIG. 13, the central pixel of the pixel neighborhood is B₃₃ for which the following classifier values are computed. c_(slash) = P₂₅ − P₄₃ + P₂₄ − P₄₂ + P₂₃ − P₄₁ + 2p_(cubic) − P₂₄ − P₄₂/4 c_(vertical) = P₂₄ − P₄₄ + P₂₃ − P₄₃ + P₂₂ − P₄₂ + 2p_(cubic) − P₂₃ − P₄₃/4 c_(backslash) = P₂₃ − P₄₅ + P₂₂ − P₄₄ + P₂₁ − P₄₃ + 2p_(cubic) − P₂₂ − P₄₄/4 $c_{horizontal} = {{\frac{3}{2}\left( {{{P_{22} - P_{24}}} + {{P_{42} - P_{44}}}} \right)} + t_{1}}$ $c_{left} = {{\frac{3}{2}\left( {{{P_{23} - P_{43}}} + {{P_{22} - P_{42}}}} \right)} + t_{2}}$ $c_{right} = {{\frac{3}{2}\left( {{{P_{23} - P_{43}}} + {{P_{24} - P_{44}}}} \right)} + t_{2}}$ The values t₁ and t₂ are threshold values that are chosen to reduce, but not eliminate, the likelihood of c_(horizontal), c_(left), and c_(right) of being smaller than c_(slash), c_(vertical), or c_(backslash). Typical values for t₁ and t₂ are 50 and 50 for an 8-bit pixel value data range.

Returning to FIG. 3, the classifier values computed in block 302 are passed to the direction of computation determination block 304. In block 304 each classifier value is compared to an activity threshold, t_(activity). A typical value for t_(activity) is 200 for an 8-bit pixel value data range. If all classifier values are greater than or equal to the activity threshold, then the direction of computation becomes a special case that is associated with the predictor value p_(cubic). Failing this first test, the classifier with the smallest value is determined. The direction associated with this classifier becomes the output of block 304. The output of block 304 and the output of block 300 are passed to the high resolution panchromatic pixel value computation block 306. In block 306 for each pixel neighborhood centered on a red, green, or blue pixel, the predictor value corresponding to the direction of computation determined in block 304 becomes the interpolated panchromatic value. A portion of the resulting high resolution panchromatic channel is illustrated in FIG. 8. In FIG. 8 the values without subscripts represent original existing panchromatic values and the values with subscripts represent interpolated panchromatic values. Additionally, FIG. 8 is a region of pixels used by low resolution panchromatic image creation block 206 (FIG. 2) to produce the region of pixels illustrated in FIG. 9. The following expressions are used in the preferred embodiment to produce the pixel values in FIG. 9. P′ ₁ =k(P ₁ +P ₃ +P ₅) P′ ₂ =k(P ₄ +P ₆ +P ₈) P′ ₃ =k(P ₉ +P ₁₁ +P ₁₃) P′ ₄ =k(P ₁₂ +P ₁₄ +P ₁₆) In these expression k is a scale factor to produce the desired pixel value range of the output values. Typically, k is one-third to produce an average pixel value. In an alternate embodiment of the present invention a different set of expressions for block 206 (FIG. 2) is used as follows. P′ ₁ =k(P ₁ +P ₃ +P ₅) P′ ₂ =k(P ₂ +P ₄ +P ₆) P′ ₃ =k(P ₉ +P ₁₁ +P ₁₃) P′ ₄ =k(P ₁₀ +P ₁₂ +P ₁₄)

FIG. 10 is a region of pixels created from the high resolution color differences creation block 210 (FIG. 2). In FIG. 10, X₁ and X₄ represent existing color difference values in the low resolution color differences image created by block 208 (FIG. 2). Interpolated color difference values X₂ and X₃ are computed in block 210 (FIG. 2) with the following expressions: X ₂=(2X ₁ +X ₄)/3 X ₃=(X ₁+2X ₄)/3 As is standard practice for bilinear interpolation, this operation is first performed on each row to triple the amount of color difference values in each row. The computation is then repeated in the vertical direction on each column to triple the amount of color difference values in each column. The output of block 210 is sent to the high resolution full color image creation block 212.

A second alternate embodiment of the present invention is now described. FIG. 2 and FIG. 3 are as in the preferred embodiment. FIG. 14 is an alternate region of pixels repeated throughout the RGBP CFA image block 200 (FIG. 2). The salient aspect of FIG. 14 is that single rows of panchromatic pixels are separated by alternating rows of four adjacent red then four adjacent green pixels and four adjacent green and then four adjacent blue pixels.

FIG. 15 is an alternate region of pixels used by low resolution RGB CFA image creation block 202 (FIG. 2) to produce the region of pixels illustrated in FIG. 6. The following expressions are used in this alternate embodiment to produce the pixel values in FIG. 6. R′ ₁ =k(R ₁₁ +R ₁₂ +R ₁₃ +R ₁₄ +R ₂₁ +R ₂₂ +R ₂₃ +R ₂₄) G′ ₂ =k(G ₁₅ +G ₁₆ +G ₁₇ +G ₁₈ +G ₂₅ +G ₂₆ +G ₂₇ +G ₂₈) G′ ₃ =k(G ₃₁ +G ₃₂ +G ₃₃ +G ₃₄ +G ₄₁ +G ₄₂ +G ₄₃ +G ₄₄) B′ ₄ =k(B ₃₅ +B ₃₆ +B ₃₇ +B ₃₈ +B ₄₅ +B ₄₆ +B ₄₇ +B ₄₈)

In these expression k is a scale factor to produce the desired pixel value range of the output values. Typical values for k are one-eighth to produce an average pixel value and one to produce a summed pixel value. It is noted that within the scope of this invention the creation of one pixel value from eight pixel values is a form of subsampling.

FIG. 16 shows four alternate regions of pixels used by both the pixel neighborhood prediction computation block 300 (FIG. 3) and the pixel neighborhood classifier computation block 302 (FIG. 3). For the case when one of the central pixels of the pixel neighborhood is a blue pixel, such as B₂₄ in FIG. 16A, the following predictor values are computed. $p_{slash} = \left\{ {{\begin{matrix} {{\left( {P_{31} + P_{13}} \right)/2},} & {{for}\quad B_{22}} \\ {{\left( {P_{32} + P_{14}} \right)/2},} & {{for}\quad B_{23}} \\ {{\left( {P_{33} + P_{15}} \right)/2},} & {{for}\quad B_{24}} \\ {{\left( {P_{34} + P_{16}} \right)/2},} & {{for}\quad B_{25}} \end{matrix}p_{vertical}} = \left\{ {{\begin{matrix} {{\left( {P_{12} + P_{32}} \right)/2},} & {{for}\quad B_{22}} \\ {{\left( {P_{13} + P_{33}} \right)/2},} & {{for}\quad B_{23}} \\ {{\left( {P_{14} + P_{34}} \right)/2},} & {{for}\quad B_{24}} \\ {{\left( {P_{15} + P_{35}} \right)/2},} & {{for}\quad B_{25}} \end{matrix}p_{backlash}} = \left\{ {{\begin{matrix} {{\left( {P_{11} + P_{33}} \right)/2},} & {{for}\quad B_{22}} \\ {{\left( {P_{12} + P_{34}} \right)/2},} & {{for}\quad B_{23}} \\ {{\left( {P_{13} + P_{35}} \right)/2},} & {{for}\quad B_{24}} \\ {{\left( {P_{14} + P_{36}} \right)/2},} & {{for}\quad B_{25}} \end{matrix}p_{horizontal}} = \left\{ \begin{matrix} {{{6G_{21}} + {3R_{41}} + B_{22}},} & {{for}\quad B_{22}} \\ {{{6G_{21}} + {3R_{41}} + B_{23}},} & {{for}\quad B_{23}} \\ {{{6G_{26}} + {3R_{46}} + B_{24}},} & {{for}\quad B_{24}} \\ {{{6G_{26}} + {3R_{46}} + B_{25}},} & {{for}\quad B_{25}} \end{matrix} \right.} \right.} \right.} \right.$ For the case when one of the central pixels of the pixel neighborhood is a red pixel, such as R₂₄ in FIG. 16B, the following predictor values are computed predictor values are computed. $p_{slash} = \left\{ {{\begin{matrix} {{\left( {P_{31} + P_{13}} \right)/2},} & {{for}\quad R_{22}} \\ {{\left( {P_{32} + P_{14}} \right)/2},} & {{for}\quad R_{23}} \\ {{\left( {P_{33} + P_{15}} \right)/2},} & {{for}\quad R_{24}} \\ {{\left( {P_{34} + P_{16}} \right)/2},} & {{for}\quad R_{25}} \end{matrix}p_{vertical}} = \left\{ {{\begin{matrix} {{\left( {P_{12} + P_{32}} \right)/2},} & {{for}\quad R_{22}} \\ {{\left( {P_{13} + P_{33}} \right)/2},} & {{for}\quad R_{23}} \\ {{\left( {P_{14} + P_{34}} \right)/2},} & {{for}\quad R_{24}} \\ {{\left( {P_{15} + P_{35}} \right)/2},} & {{for}\quad R_{25}} \end{matrix}p_{backslash}} = \left\{ {{\begin{matrix} {{\left( {P_{11} + P_{33}} \right)/2},} & {{for}\quad R_{22}} \\ {{\left( {P_{12} + P_{34}} \right)/2},} & {{for}\quad R_{23}} \\ {{\left( {P_{13} + P_{35}} \right)/2},} & {{for}\quad R_{24}} \\ {{\left( {P_{14} + P_{36}} \right)/2},} & {{for}\quad R_{25}} \end{matrix}p_{horizontal}} = \left\{ \begin{matrix} {{{6G_{21}} + {3R_{22}} + B_{41}},} & {{for}\quad R_{22}} \\ {{{6G_{21}} + {3R_{23}} + B_{41}},} & {{for}\quad R_{23}} \\ {{{6G_{26}} + {3R_{24}} + B_{46}},} & {{for}\quad R_{24}} \\ {{{6G_{26}} + {3R_{25}} + B_{46}},} & {{for}\quad R_{25}} \end{matrix} \right.} \right.} \right.} \right.$ For the case when one of the central pixels of the pixel neighborhood is a green pixel, such as G₂₄ in FIG. 16C, the following predictor values are computed predictor values are computed. $p_{slash} = \left\{ {{\begin{matrix} {{\left( {P_{31} + P_{13}} \right)/2},} & {{for}\quad G_{22}} \\ {{\left( {P_{32} + P_{14}} \right)/2},} & {{for}\quad G_{23}} \\ {{\left( {P_{33} + P_{15}} \right)/2},} & {{for}\quad G_{24}} \\ {{\left( {P_{34} + P_{16}} \right)/2},} & {{for}\quad G_{25}} \end{matrix}p_{vertical}} = \left\{ {{\begin{matrix} {{\left( {P_{12} + P_{32}} \right)/2},} & {{for}\quad G_{22}} \\ {{\left( {P_{13} + P_{33}} \right)/2},} & {{for}\quad G_{23}} \\ {{\left( {P_{14} + P_{34}} \right)/2},} & {{for}\quad G_{24}} \\ {{\left( {P_{15} + P_{35}} \right)/2},} & {{for}\quad G_{25}} \end{matrix}p_{backslash}} = \left\{ {{\begin{matrix} {{\left( {P_{11} + P_{33}} \right)/2},} & {{for}\quad G_{22}} \\ {{\left( {P_{12} + P_{34}} \right)/2},} & {{for}\quad G_{23}} \\ {{\left( {P_{13} + P_{35}} \right)/2},} & {{for}\quad G_{24}} \\ {{\left( {P_{14} + P_{36}} \right)/2},} & {{for}\quad G_{25}} \end{matrix}p_{horizontal}} = \left\{ \begin{matrix} {{{6G_{22}} + {3R_{42}} + B_{21}},} & {{for}\quad G_{22}} \\ {{{6G_{23}} + {3R_{43}} + B_{21}},} & {{for}\quad G_{23}} \\ {{{6G_{24}} + {3R_{44}} + B_{26}},} & {{for}\quad G_{24}} \\ {{{6G_{25}} + {3R_{45}} + B_{26}},} & {{for}\quad G_{25}} \end{matrix} \right.} \right.} \right.} \right.$ For the case when one of the central pixels of the pixel neighborhood is a green pixel, such as G₂₄ in FIG. 16D, the following predictor values are computed predictor values are computed. $p_{slash} = \left\{ {{\begin{matrix} {{\left( {P_{31} + P_{13}} \right)/2},} & {{for}\quad G_{22}} \\ {{\left( {P_{32} + P_{14}} \right)/2},} & {{for}\quad G_{23}} \\ {{\left( {P_{33} + P_{15}} \right)/2},} & {{for}\quad G_{24}} \\ {{\left( {P_{34} + P_{16}} \right)/2},} & {{for}\quad G_{25}} \end{matrix}p_{vertical}} = \left\{ {{\begin{matrix} {{\left( {P_{12} + P_{32}} \right)/2},} & {{for}\quad G_{22}} \\ {{\left( {P_{13} + P_{33}} \right)/2},} & {{for}\quad G_{23}} \\ {{\left( {P_{14} + P_{34}} \right)/2},} & {{for}\quad G_{24}} \\ {{\left( {P_{15} + P_{35}} \right)/2},} & {{for}\quad G_{25}} \end{matrix}p_{backslash}} = \left\{ {{\begin{matrix} {{\left( {P_{11} + P_{33}} \right)/2},} & {{for}\quad G_{22}} \\ {{\left( {P_{12} + P_{34}} \right)/2},} & {{for}\quad G_{23}} \\ {{\left( {P_{13} + P_{35}} \right)/2},} & {{for}\quad G_{24}} \\ {{\left( {P_{14} + P_{36}} \right)/2},} & {{for}\quad G_{25}} \end{matrix}p_{horizontal}} = \left\{ \begin{matrix} {{{6G_{22}} + {3R_{21}} + B_{42}},} & {{for}\quad G_{22}} \\ {{{6G_{23}} + {3R_{21}} + B_{43}},} & {{for}\quad G_{23}} \\ {{{6G_{24}} + {3R_{26}} + B_{44}},} & {{for}\quad G_{24}} \\ {{{6G_{25}} + {3R_{26}} + B_{45}},} & {{for}\quad G_{25}} \end{matrix} \right.} \right.} \right.} \right.$ There is one set of classifier values computed by block 302 (FIG. 3). Though the color of the central pixel in a given neighborhood can be different, the same expressions are used for computing the classifiers. Referring to FIG. 16A, the central pixel of the pixel neighborhood is B₂₄ and the following classifier values are computed. $c_{slash} = \left\{ {{\begin{matrix} {{{{P_{30} - P_{12}}} + {{P_{31} - P_{13}}} + {{P_{32} - P_{14}}}},} & {{for}\quad B_{22}} \\ {{{{P_{31} - P_{13}}} + {{P_{32} - P_{14}}} + {{P_{33} - P_{15}}}},} & {{for}\quad B_{23}} \\ {{{{P_{32} - P_{14}}} + {{P_{33} - P_{15}}} + {{P_{34} - P_{16}}}},} & {{for}\quad B_{24}} \\ {{{{P_{33} - P_{15}}} + {{P_{34} - P_{16}}} + {{P_{35} - P_{17}}}},} & {{for}\quad B_{25}} \end{matrix}c_{vertical}} = \left\{ {{\begin{matrix} {{{{P_{11} - P_{31}}} + {{P_{12} - P_{32}}} + {{P_{13} - P_{33}}}},} & {{for}\quad B_{22}} \\ {{{{P_{12} - P_{32}}} + {{P_{13} - P_{33}}} + {{P_{14} - P_{34}}}},} & {{for}\quad B_{23}} \\ {{{{P_{13} - P_{33}}} + {{P_{14} - P_{34}}} + {{P_{15} - P_{35}}}},} & {{for}\quad B_{24}} \\ {{{{P_{15} - P_{34}}} + {{P_{15} - P_{35}}} + {{P_{16} - P_{36}}}},} & {{for}\quad B_{25}} \end{matrix}c_{backlash}} = \left\{ {{\begin{matrix} {{{{P_{10} - P_{32}}} + {{P_{11} - P_{33}}} + {{P_{12} - P_{34}}}},} & {{for}\quad B_{22}} \\ {{{{P_{11} - P_{33}}} + {{P_{12} - P_{34}}} + {{P_{13} - P_{35}}}},} & {{for}\quad B_{23}} \\ {{{{P_{12} - P_{34}}} + {{P_{13} - P_{35}}} + {{P_{14} - P_{36}}}},} & {{for}\quad B_{24}} \\ {{{{P_{13} - P_{35}}} + {{P_{14} - P_{36}}} + {{P_{15} - P_{37}}}},} & {{for}\quad B_{25}} \end{matrix}c_{horizontal}} = \left\{ \begin{matrix} {{{{B_{22} - B_{24}}} + {{P_{11} - P_{13}}} + {{P_{31} - P_{33}}} + t},} & {{for}\quad B_{22}} \\ {{{{B_{22} - B_{24}}} + {{P_{12} - P_{14}}} + {{P_{32} - P_{34}}} + t},} & {{for}\quad B_{23}} \\ {{{{B_{23} - B_{25}}} + {{P_{13} - P_{15}}} + {{P_{33} - P_{35}}} + t},} & {{for}\quad B_{24}} \\ {{{{B_{23} - B_{25}}} + {{P_{14} - P_{16}}} + {{P_{34} - P_{36}}} + t},} & {{for}\quad B_{25}} \end{matrix} \right.} \right.} \right.} \right.$ The value t is a threshold value that is chosen to reduce, but not eliminate, the likelihood of c_(horizontal), of being smaller than c_(slash), c_(vertical) or c_(backslash). A typical values for t is 20 for an 8-bit pixel value data range. Referring to FIG. 16B, the central pixel of the pixel neighborhood is R₂₄ and the following classifier values are computed. $c_{slash} = \left\{ {{\begin{matrix} {{{{P_{30} - P_{12}}} + {{P_{31} - P_{13}}} + {{P_{32} - P_{14}}}},} & {{for}\quad R_{22}} \\ {{{{P_{31} - P_{13}}} + {{P_{32} - P_{14}}} + {{P_{33} - P_{15}}}},} & {{for}\quad R_{23}} \\ {{{{P_{32} - P_{14}}} + {{P_{33} - P_{15}}} + {{P_{34} - P_{16}}}},} & {{for}\quad R_{24}} \\ {{{{P_{33} - P_{15}}} + {{P_{34} - P_{16}}} + {{P_{35} - P_{17}}}},} & {{for}\quad R_{25}} \end{matrix}c_{vertical}} = \left\{ {{\begin{matrix} {{{{P_{11} - P_{31}}} + {{P_{12} - P_{32}}} + {{P_{13} - P_{33}}}},} & {{for}\quad R_{22}} \\ {{{{P_{12} - P_{32}}} + {{P_{13} - P_{33}}} + {{P_{14} - P_{34}}}},} & {{for}\quad R_{23}} \\ {{{{P_{13} - P_{33}}} + {{P_{14} - P_{34}}} + {{P_{15} - P_{35}}}},} & {{for}\quad R_{24}} \\ {{{{P_{15} - P_{34}}} + {{P_{15} - P_{35}}} + {{P_{16} - P_{36}}}},} & {{for}\quad R_{25}} \end{matrix}c_{backlash}} = \left\{ {{\begin{matrix} {{{{P_{10} - P_{32}}} + {{P_{11} - P_{33}}} + {{P_{12} - P_{34}}}},} & {{for}\quad R_{22}} \\ {{{{P_{11} - P_{33}}} + {{P_{12} - P_{34}}} + {{P_{13} - P_{35}}}},} & {{for}\quad R_{23}} \\ {{{{P_{12} - P_{34}}} + {{P_{13} - P_{35}}} + {{P_{14} - P_{36}}}},} & {{for}\quad R_{24}} \\ {{{{P_{13} - P_{35}}} + {{P_{14} - P_{36}}} + {{P_{15} - P_{37}}}},} & {{for}\quad R_{25}} \end{matrix}c_{horizontal}} = \left\{ \begin{matrix} {{{{R_{22} - R_{24}}} + {{P_{11} - P_{13}}} + {{P_{31} - P_{33}}} + t},} & {{for}\quad R_{22}} \\ {{{{R_{22} - R_{24}}} + {{P_{12} - P_{14}}} + {{P_{32} - P_{34}}} + t},} & {{for}\quad R_{23}} \\ {{{{R_{23} - R_{25}}} + {{P_{13} - P_{15}}} + {{P_{33} - P_{35}}} + t},} & {{for}\quad R_{24}} \\ {{{{R_{23} - R_{25}}} + {{P_{14} - P_{16}}} + {{P_{34} - P_{36}}} + t},} & {{for}\quad R_{25}} \end{matrix} \right.} \right.} \right.} \right.$ The value t is a threshold value that is chosen to reduce, but not eliminate, the likelihood of c_(horizontal), of being smaller than c_(slash), c_(vertical), or c_(backslash). A typical values for t is 20 for an 8-bit pixel value data range. Referring to FIG. 16C, the central pixel of the pixel neighborhood is G₂₄ and the following classifier values are computed. $c_{slash} = \left\{ {{\begin{matrix} {{{{P_{30} - P_{12}}} + {{P_{31} - P_{13}}} + {{P_{32} - P_{14}}}},} & {{for}\quad G_{22}} \\ {{{{P_{31} - P_{13}}} + {{P_{32} - P_{14}}} + {{P_{33} - P_{15}}}},} & {{for}\quad G_{23}} \\ {{{{P_{32} - P_{14}}} + {{P_{33} - P_{15}}} + {{P_{34} - P_{16}}}},} & {{for}\quad G_{24}} \\ {{{{P_{33} - P_{15}}} + {{P_{34} - P_{16}}} + {{P_{35} - P_{17}}}},} & {{for}\quad G_{25}} \end{matrix}c_{vertical}} = \left\{ {{\begin{matrix} {{{{P_{11} - P_{31}}} + {{P_{12} - P_{32}}} + {{P_{13} - P_{33}}}},} & {{for}\quad G_{22}} \\ {{{{P_{12} - P_{32}}} + {{P_{13} - P_{33}}} + {{P_{14} - P_{34}}}},} & {{for}\quad G_{23}} \\ {{{{P_{13} - P_{33}}} + {{P_{14} - P_{34}}} + {{P_{15} - P_{35}}}},} & {{for}\quad G_{24}} \\ {{{{P_{15} - P_{34}}} + {{P_{15} - P_{35}}} + {{P_{16} - P_{36}}}},} & {{for}\quad G_{25}} \end{matrix}c_{backlash}} = \left\{ {{\begin{matrix} {{{{P_{10} - P_{32}}} + {{P_{11} - P_{33}}} + {{P_{12} - P_{34}}}},} & {{for}\quad G_{22}} \\ {{{{P_{11} - P_{33}}} + {{P_{12} - P_{34}}} + {{P_{13} - P_{35}}}},} & {{for}\quad G_{23}} \\ {{{{P_{12} - P_{34}}} + {{P_{13} - P_{35}}} + {{P_{14} - P_{36}}}},} & {{for}\quad G_{24}} \\ {{{{P_{13} - P_{35}}} + {{P_{14} - P_{36}}} + {{P_{15} - P_{37}}}},} & {{for}\quad G_{25}} \end{matrix}c_{horizontal}} = \left\{ \begin{matrix} {{{{G_{22} - G_{24}}} + {{P_{11} - P_{13}}} + {{P_{31} - P_{33}}} + t},} & {{for}\quad G_{22}} \\ {{{{G_{22} - G_{24}}} + {{P_{12} - P_{14}}} + {{P_{32} - P_{34}}} + t},} & {{for}\quad G_{23}} \\ {{{{G_{23} - G_{25}}} + {{P_{13} - P_{15}}} + {{P_{33} - P_{35}}} + t},} & {{for}\quad G_{24}} \\ {{{{G_{23} - G_{25}}} + {{P_{14} - P_{16}}} + {{P_{34} - P_{36}}} + t},} & {{for}\quad G_{25}} \end{matrix} \right.} \right.} \right.} \right.$ The value t is a threshold value that is chosen to reduce, but not eliminate, the likelihood of c_(horizontal), of being smaller than c_(slash), c_(vertical), or c_(backslash). A typical value for t is 20 for an 8-bit pixel value data range.

Returning to FIG. 3, the classifier values computed in block 302 are passed to the direction of computation determination block 304. In block 304 each classifier value is compared to an activity threshold, t_(activity). A typical value for t_(activity) is 200 for an 8-bit pixel value data range. If all classifier values are greater than or equal to the activity threshold, then the direction of computation becomes a special case that is associated with the predictor value p_(cubic). Failing this first test, the classifier with the smallest value is determined. The direction associated with this classifier becomes the output of block 304. The output of block 304 and the output of block 300 are passed to the high resolution panchromatic pixel value computation block 306. In block 306 for each pixel neighborhood centered on a red, green, or blue pixel, the predictor value corresponding to the direction of computation determined in block 304 becomes the interpolated panchromatic value. A portion of the resulting high resolution panchromatic channel is illustrated in FIG. 17. In FIG. 17 the values without subscripts represent original existing panchromatic values and the values with subscripts represent interpolated panchromatic values. Additionally, FIG. 17 is a region of pixels used by low resolution panchromatic image creation block 206 (FIG. 2) to produce the region of pixels illustrated in FIG. 9. The following expressions are used in the preferred embodiment to produce the pixel values in FIG. 9. P′ ₁ =k(P ₂₀ +P ₂₁ +P ₂₂ +P ₂₃ +P ₄₀ +P ₄₁ +P ₄₂ +P ₄₃) P′ ₂ =k(P ₂₄ +P ₂₅ +P ₂₆ +P ₂₇ +P ₄₄ +P ₄₅ +P ₄₆ +P ₄₇) P′ ₃ =k(P ₆₀ +P ₆₁ +P ₆₂ +P ₆₃ +P ₈₀ +P ₈₁ +P ₈₂ +P ₈₃) P′ ₄ =k(P ₆₄ +P ₆₅ +P ₆₆ +P ₆₇ +P ₈₄ +P ₈₅ +P ₈₆ +P ₈₇)

In these expression k is a scale factor to produce the desired pixel value range of the output values. Typically, k is one-eighth to produce an average pixel value.

FIG. 18 is a region of pixels created from the high resolution color differences creation block 210 (FIG. 2). In FIG. 18, X₁ and X₅ represent existing color difference values in the low resolution color differences image created by block 208 (FIG. 2). Interpolated color difference values X₂, X₃, and X₄ are computed in block 210 (FIG. 2) with the following expressions: X ₂=(3X ₁ +X ₅)/4 X ₃=(X ₁ +X ₅)/2 X ₄=(X ₁+3X ₅)/4 As is standard practice for bilinear interpolation, this operation is first performed on each row to triple the amount of color difference values in each row. The computation is then repeated in the vertical direction on each column to triple the amount of color difference values in each column. The output of block 210 is sent to the high resolution full color image creation block 212.

A third alternate embodiment of the present invention is now described. FIG. 2 and FIG. 3 are as in the preferred embodiment. FIG. 19 is an alternate region of pixels repeated throughout the RGBP CFA image block 200 (FIG. 2). The salient aspect of FIG. 19 is that alternating single rows and single columns of panchromatic pixels are separated by isolated red, green, and blue pixels.

FIG. 20 is an alternate region of pixels used by low resolution RGB CFA image creation block 202 (FIG. 2) to produce the region of pixels illustrated in FIG. 6. The following expressions are used in this alternate embodiment to produce the pixel values in FIG. 6. R′ ₁ =k(R ₁₁ +R ₁₂ +R ₂₁ +R ₂₂) G′ ₂ =k(G ₁₃ +G ₁₄ +G ₂₃ +G ₂₄) G′ ₃ =k(G ₃₁ +G ₃₂ +G ₄₁ +G ₄₂) B′ ₄ =k(B ₃₃ +B ₃₄ +B ₄₃ +B ₄₄)

In these expression k is a scale factor to produce the desired pixel value range of the output values. Typical values for k are one-fourth to produce an average pixel value and one to produce a summed pixel value. It is noted that within the scope of this invention the creation of one pixel value from four pixel values is a form of subsampling.

FIG. 21 shows an alternate region of pixels used by both the pixel neighborhood prediction computation block 300 (FIG. 3) and the pixel neighborhood classifier computation block 302 (FIG. 3). The central pixel, X₂₂, is either a red, green, or blue pixel. For the alternate region of pixels, the following predictor values are computed. p _(slash)=(P ₃₁ +P ₁₃)/2+└(−P ₃₁ +P ₂₁ +P ₁₂ −P ₁₃)+(−P ₁₃ +P ₂₃ +P ₃₂ −P ₃₁)┘/16 p _(vertical)=(P ₁₂ +P ₃₂)/2+└(−P ₁₁+2P ₂₁ −P ₃₁)+(−P ₃₃+2P ₂₃ −P ₁₃)┘/16 p _(backslash)=(P ₁₁ +P ₃₃)/2+└(−P ₁₁ +P ₂₁ +P ₃₂ −P ₃₃)+(−P ₃₃ +P ₂₃ +P ₁₂ −P ₁₁)┘/16 p _(horizontal)=(P ₂₁ +P ₂₃)/2+└(−P ₃₁+2P ₃₂ −P ₃₃)+(−P₁₁+2P ₁₂ −P ₁₃)┘/16 p _(flat)=(P ₁₁ +P ₁₂ +P ₂₁ +P ₂₃ +P ₃₁ +P ₃₂ +P ₃₃)/8 For the same alternate region of pixels, the following classifiers are computed. c _(slash) =|P ₂₁ −P ₁₂ |+|P ₃₁ −P ₁₃ |+|P ₃₂ −P ₂₃ |+|−P ₃₁ +P ₂₁ +P ₁₂ −P ₁₃ |+|−P ₃₁ +P ₃₂ +P ₂₃ −P ₁₃| c _(vertical) =|P ₁₁ −P ₃₁ |+|P ₁₂ −P ₃₂ |+|P ₁₃ −P ₃₃ |+|−P ₁₁+2P ₂₁ −P ₃₁ |+|−P ₁₃+2P ₂₃ −P ₃₃| c _(backslash) =|P ₁₁ −P ₃₃ |+|P ₁₂ −P ₂₃ |+|P ₂₁ −P ₃₂ |+|−P ₁₁ +P ₂₁ +P ₃₂ −P ₃₃ |+|−P ₁₁ +P ₁₂ +P ₂₃ −P ₃₃| c _(horizontal) =|P ₁₁ −P ₁₃ |+|P ₂₁ −P ₂₃ |+|P ₃₁ −P ₃₃ |+|−P ₁₁+2P ₁₂ −P ₁₃ |+|−P ₃₁+2P ₃₂ −P ₃₃|

Returning to FIG. 3, the classifier values computed in block 302 are passed to the direction of computation determination block 304. In block 304 each classifier value is compared to an activity threshold, t_(activity). A typical value for t_(activity) is 160 for an 8-bit pixel value data range. If all classifier values are less than or equal to the activity threshold, then the direction of computation becomes a special case that is associated with the predictor value p_(flat). Failing this first test, the classifier with the smallest value is determined. The direction associated with this classifier becomes the output of block 304. The output of block 304 and the output of block 300 are passed to the high resolution panchromatic pixel value computation block 306. In block 306 for each pixel neighborhood centered on a red, green, or blue pixel, the predictor value corresponding to the direction of computation determined in block 304 becomes the interpolated panchromatic value. A portion of the resulting high resolution panchromatic channel is illustrated in FIG. 22. In FIG. 22 the values without subscripts represent original existing panchromatic values and the values with subscripts represent interpolated panchromatic values. Additionally, FIG. 22 is a region of pixels used by low resolution panchromatic image creation block 206 (FIG. 2) to produce the region of pixels illustrated in FIG. 9. The following expressions are used in the preferred embodiment to produce the pixel values in FIG. 9. P′ ₁ =k(P ₁₁ +P ₁₂ +P ₂₁ +P ₂₂) P′ ₂ =k(P ₁₃ +P ₁₄ +P ₂₃ +P ₂₄) P′ ₃ =k(P ₃₁ +P ₃₂ +P ₄₁ +P ₄₂) P′ ₄ =k(P ₃₃ +P ₃₄ +P ₄₃ +P ₄₄)

In these expression k is a scale factor to produce the desired pixel value range of the output values. Typically, k is one-fourth to produce an average pixel value.

FIG. 18 is a region of pixels created from the high resolution color differences creation block 210 (FIG. 2). In FIG. 18, X₁ and X₅ represent existing color difference values in the low resolution color differences image created by block 208 (FIG. 2). Interpolated color difference values X₂, X₃, and X₄ are computed in block 210 (FIG. 2) with the following expressions: X ₂=(3X ₁ +X ₅)/4 X ₃=(X ₁ +X ₅)/2 X ₄=(X ₁+3X ₅)/4 As is standard practice for bilinear interpolation, this operation is first performed on each row to triple the amount of color difference values in each row. The computation is then repeated in the vertical direction on each column to triple the amount of color difference values in each column. The output of block 210 is sent to the high resolution full color image creation block 212.

The interpolation algorithm disclosed in the preferred embodiment(s) of the present invention can be employed in a variety of user contexts and environments. Exemplary contexts and environments include, without limitation, wholesale digital photofinishing (which involves exemplary process steps or stages such as film in, digital processing, prints out), retail digital photofinishing (film in, digital processing, prints out), home printing (home scanned film or digital images, digital processing, prints out), desktop software (software that applies algorithms to digital prints to make them better—or even just to change them), digital fulfillment (digital images in—from media or over the web, digital processing, with images out—in digital form on media, digital form over the web, or printed on hard-copy prints), kiosks (digital or scanned input, digital processing, digital or scanned output), mobile devices (e.g., PDA or cell phone that can be used as a processing unit, a display unit, or a unit to give processing instructions), and as a service offered via the World Wide Web.

In each case, the interpolation algorithm can stand alone or can be a component of a larger system solution. Furthermore, the interfaces with the algorithm, e.g., the scanning or input, the digital processing, the display to a user (if needed), the input of user requests or processing instructions (if needed), the output, can each be on the same or different devices and physical locations, and communication between the devices and locations can be via public or private network connections, or media based communication. Where consistent with the foregoing disclosure of the present invention, the algorithm itself can be fully automatic, can have user input (be fully or partially manual), can have user or operator review to accept/reject the result, or can be assisted by metadata (metadata that can be user supplied, supplied by a measuring device (e.g. in a camera), or determined by an algorithm). Moreover, the algorithm can interface with a variety of workflow user interface schemes.

The interpolation algorithm disclosed herein in accordance with the invention can have interior components that utilize various data detection and reduction techniques (e.g., face detection, eye detection, skin detection, flash detection)

The invention has been described in detail with particular reference to certain preferred embodiments thereof, but it will be understood that variations and modifications can be effected within the spirit and scope of the invention.

PARTS LIST

-   110 Computer System -   112 Microprocessor-based Unit -   114 Display -   116 Keyboard -   118 Mouse -   120 Selector on Display -   122 Disk Drive Unit -   124 Compact Disk-read Only Memory (CD-ROM) -   126 Floppy Disk -   127 Network Connection -   128 Printer -   130 Personal Computer Card (PC card) -   132 PC Card Reader -   134 Digital Camera -   136 Camera Docking Port -   138 Cable Connection -   140 Wireless Connection -   200 RGBP CFA Image -   202 Low Resolution RGB CFA Image Creation -   204 High Resolution Panchromatic Image Creation -   206 Low Resolution Panchromatic Image Creation -   208 Low Resolution Color Differences Creation -   210 High Resolution Color Differences Creation -   212 High Resolution Full Color Image Creation -   214 High Resolution Full Color Image -   216 Low Resolution Color Differences Image Interpolation -   300 Pixel Neighborhood Predictor Computation -   302 Pixel Neighborhood Classifier Computation -   304 Direction of Computation Determination -   306 High Resolution Panchromatic Pixel Value Computation 

1. A method for forming a final digital color image, comprising: (a) capturing an image using an image sensor having panchromatic pixels and color pixels corresponding to at least two color photoresponses; (b) providing from the captured image a digital high resolution panchromatic image and a digital high resolution color differences image; and (c) using the digital high resolution panchromatic image and the digital high resolution color differences image to produce the final digital high resolution full color image.
 2. The method of claim 1 wherein step (a) includes color pixels having the photo sensitivities red, green, and blue.
 3. The method of claim 1 wherein step (a) includes color pixels having the photo sensitivities cyan, magenta, and yellow.
 4. The method of claim 2, wherein step (b) includes using pixel neighborhood predictor values responsive to pixel neighborhood classifier values to produce the digital high resolution panchromatic image.
 5. The method of claim 2, wherein step (b) includes using a digital interpolated low resolution color differences image to produce the digital high resolution color differences image.
 6. The method of claim 5, wherein step (b) further includes using a low resolution panchromatic image and a low resolution RGB CFA image to produce the digital interpolated low resolution color differences image.
 7. The method of claim 6, wherein step b) further includes using the low resolution panchromatic image and the low resolution RGB CFA image to produce a low resolution color differences image, and using the low resolution color difference image to produce the digital interpolated low resolution color differences image.
 8. The method of claim 6, including averaging and subsampling the digital high resolution panchromatic image to produce the digital low resolution panchromatic image.
 9. The method of claim 6, including summing or averaging and subsampling a digital RGBP CFA image to produce the digital low resolution RGB CFA image.
 10. The method of claim 7 wherein the image sensor has panchromatic pixels (P) and color pixels, red (R), green (G), and blue (B), in the following arrangement: R G P P P P G B P P P P.


11. The method of claim 7 wherein the image sensor has panchromatic pixels (P) and color pixels, red (R), green (G), and blue (B), in the following arrangement: R R R G G G P P P P P P P P P P P P G G G B B B P P P P P P P P P P P P.


12. The method of claim 7 wherein the image sensor has panchromatic pixels (P) and color pixels, red (R), green (G), and blue (B), in the following arrangement: R R R R G G G G P P P P P P P P R R R R G G G G P P P P P P P P G G G G B B B B P P P P P P P P G G G G B B B B P P P P P P P P.


13. The method of claim 7 wherein the image sensor has panchromatic pixels (P) and color pixels, red (R), green (G), and blue (B), in the following arrangement: R P R P G P G P P P P P P P P P R P R P G P G P P P P P P P P P G P G P B P B P P P P P P P P P G P G P B P B P P P P P P P P P. 